package com.programmercarl.tree;

/**
 * https://leetcode.cn/problems/same-tree/description/
 *
 * @author yulongtian
 * @create 2024-12-18 9:37
 */
public class Test08 {
    public static void main(String[] args) {

    }

    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    public boolean isSameTree(TreeNode p, TreeNode q) {
        return checkTree(p, q);
    }

    public boolean checkTree(TreeNode p, TreeNode q) {
        if (p == null && q == null) {
            return true;
        } else if (p == null && q != null) {
            return false;
        } else if (p != null && q == null) {
            return false;
        } else {
            if (p.val != q.val) {
                return false;
            }
        }

        return checkTree(p.left, q.left) && checkTree(p.right, q.right);
    }

}
